|
In the area of mathematics called combinatorial group theory, the Schreier coset graph is a graph associated to a group ''G'', a generating set , and a subgroup ''H'' ≤ ''G''. ==Description== The vertices of the graph are the right cosets ''Hg'' = for ''g'' in ''G''. The edges of the graph are of the form (''Hg'',''Hgxi''). The Cayley graph of the group ''G'' with is the Schreier coset graph for ''H'' = ,. A spanning tree of a Schreier coset graph corresponds to a Schreier transversal, as in Schreier's subgroup lemma, . The book "Categories and Groupoids" listed below relates this to the theory of covering morphisms of groupoids. A subgroup ''H'' of a group ''G'' determines a covering morphism of groupoids and if ''X'' is a generating set for ''G'' then its inverse image under ''p'' is the Schreier graph of ''(G,X)''. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Schreier coset graph」の詳細全文を読む スポンサード リンク
|